Adding recursion to Dpi
نویسندگان
چکیده
Dpi is a distributed version of the pi-calculus, in which processes are explicitly located, and a migration construct may be used for moving between locations. We argue that adding a recursion operator to the language increases significantly its descriptive power. But typing recursive processes requires the use of potentially infinite types. We show that the capability-based typing system of Dpi can be extended to co-inductive types so that recursive processes can be successfully supported. We also show that, as in the pi-calculus, recursion can be implemented via iteration. This translation improves on the standard ones by being compositional but still requires co-inductive types and comes with a significant migration overhead in our distributed setting.
منابع مشابه
Adding recursion to Dpi ( Extended abstract ) Samuel Hym
Dpi is a distributed version of the pi-calculus, in which processes are explicitly located, and a migration construct may be used for moving between locations. We argue that adding a recursion operator to the language increases significantly its descriptive power. But typing recursive processes requires the use of potentially infinite types. We show that the capability-based typing system of Dp...
متن کاملLow dose detection of γ radiation via solvent assisted fluorescence quenching.
Development of low cost, easy-to-use chemical sensor systems for low dose detection of γ radiation remains highly desired for medical radiation therapy and nuclear security monitoring. We report herein on a new fluorescence sensor molecule, 4,4'-di(1H-phenanthro[9,10-d]imidazol-2-yl)biphenyl (DPI-BP), which can be dissolved into halogenated solvents (e.g., CHCl3, CH2Cl2) to enable instant detec...
متن کاملClassification-based Policy Iteration with a Critic
In this paper, we study the effect of adding a value function approximation component (critic) to rollout classification-based policy iteration (RCPI) algorithms. The idea is to use a critic to approximate the return after we truncate the rollout trajectories. This allows us to control the bias and variance of the rollout estimates of the action-value function. Therefore, the introduction of a ...
متن کاملHigher type recursion, ramification and polynomial time
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a ramified type structure, and by adding linear concepts to the lambda calculus.
متن کاملAdding Recursion to Graph Transformation
In this paper we define recursive rules in the double pushout approach (DPO) to graph transformation. Classical DPO rules are extended with a base case condition and a recursion condition. Mechanisms are provided to pass the match from both conditions to the rule’s left hand side, and also between two consecutive steps in the recursion. The approach is useful when recursive structures (such as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 373 شماره
صفحات -
تاریخ انتشار 2007